Disjunction Property and Finite Model Property For an Intuitionistic Epistemic Logic

نویسنده

  • Yoichi Hirai
چکیده

We show finite model property, disjunction property and decidability for an intuitionistic epistemic logic IEC. Intuitionistic logic is originally a formalisation of a single mathematician whose knowledge increases over time. The logic IEC formalises multiple agents that communicate asynchronously and whose knowledge increases over time. Although soundness and strong completeness for IEC for a Kripke semantics was straightforward, finite model property and disjunction property required a special technique called modal map on sets of formulas.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Complexity of the Disjunction and ExistentialProperties in

This paper considers the computational complexity of the disjunc-tion and existential properties of intuitionistic logic. We prove that the disjunction property holds feasibly for intuitionistic propositional logic; i.e., from a proof of A _ B, a proof either of A or of B can be found in polynomial time. For intuitionistic predicate logic, we prove superexponential lower bounds for the disjunct...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Polynomial space hardness without disjunction property

In [HT11], Horč́ık and Terui show that if a substructural logic enjoys the disjunction property, then its tautology problem is PSPACE-hard. We prove that all substructural logics in the interval between intuitionistic logic and generalized Hájek basic logic have a PSPACE-hard tautology problem, which implies that uncountably many substructural logics lacking the disjunction property have a PSPAC...

متن کامل

The Disjunction Property of the Logics with Axioms of Only One Variable

The logics treated here are the intermediate propositional logics of the form LJ + Ni(a), where Ni(a)’s are axioms of only one variable studied in Nishimura [6]. As is easily seen, the problem of the disjunction property of LJ+Ni(a) starts from i = 10 and the case of odd i can be trivially neglected. The case of i = 10 was solved by Kreisel and Putnam [5] and other cases except i = 14 were solv...

متن کامل

The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic

This paper considers the computational complexity of the disjunction and existential properties of intuitionistic logic. We prove that the disjunction property holds feasibly for intuitionistic propositional logic; i.e., from a proof of A ∨ B , a proof either of A or of B can be found in polynomial time. For intuitionistic predicate logic, we prove superexponential lower bounds for the disjunct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010